Meeting Deadlines Together
نویسندگان
چکیده
This paper studies safety, progress, and non-zeno properties of Communicating Timed Automata (CTAs), which are timed automata (TA) extended with unbounded communication channels, and presents a procedure to build timed global specifications from systems of CTAs. We define safety and progress properties for CTAs by extending properties studied in communicating finitestate machines to the timed setting. We then study non-zenoness for CTAs; our aim is to prevent scenarios in which the participants have to execute an infinite number of actions in a finite amount of time. We propose sound and decidable conditions for these properties, and demonstrate the practicality of our approach with an implementation and experimental evaluations of our theory. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Program
منابع مشابه
Portfolio Management Method for Deadline Planning
We introduce a portfolio management method that uses effort estimates to build sets of feasible deadlines for software projects at the bidding stage. Effort estimates can involve considerable error, and this must be taken into account when selecting deadlines. We show how a simple probability model can allow for possible errors. The model is built using a single effort estimate for each current...
متن کاملConnecting cell fate decision networks in hematopoeisis from the outside in
and scholarship deadlines precede meetings by four months. Please check www.keystonesymposia.org/2011meetings for details.Global Health Travel Award application deadlines for the six designated Global Health conferences precede meeting dates by five months.METING SEA SON40thKESTONEPOIATOP-QUALITY LIFE SCIENCE RESEARCHCONFERENCES PRICELESS...
متن کاملA Self-adaptive Auto-scaling Method for Scientific Applications on HPC Environments and Clouds
High intensive computation applications can usually take days to months to finish an execution. During this time, it is common to have variations of the available resources when considering that such hardware is usually shared among a plurality of researchers/departments within an organization. On the other hand, High Performance Clusters can take advantage of Cloud Computing bursting technique...
متن کاملA General Distributed Scalable Peer to Peer Scheduler for Mixed Tasks in Grids
We consider non-preemptively scheduling a bag of independent mixed tasks in computational grids. We construct a novel Generalized Distributed Scheduler (GDS) for tasks with different priorities and deadlines. Tasks are ranked based upon priority and deadline and scheduled. Tasks are shuffled to earlier points to pack the schedule and create fault tolerance. Dispatching is based upon task-resour...
متن کاملA general distributed scalable grid scheduler for independent tasks
We consider non-preemptively scheduling a bag of independent mixed tasks (hard, firm and soft) in computational grids. Based upon task type, we construct a novel generalized distributed scheduler (GDS) for scheduling tasks with different priorities and deadlines. GDS is scalable and does not require knowledge of the global state of the system. It is composed of several phases: a multiple attrib...
متن کاملThe BEST Desktop Soft Real-Time Scheduler
Best-effort CPU scheduling is an attractive model for desktop computing because it is simple to use. However, best-effort models do not provide support for applications with deadlines. Soft real-time schedulers allocate the CPU for workloads containing soft deadlines by relying on developers and users to supply timing requirements to the system. BEST is an enhanced best-effort scheduler designe...
متن کامل